Symmetry Breaking by Metaheuristic Search
نویسندگان
چکیده
Several methods exist for breaking symmetry in constraint problems, but most potentially suffer from high memory requirements, high computational overhead, or both. We describe a new partial symmetry breaking method that can be applied to arbitrary variable/value symmetries. It models dominance detection as a nonstationary optimisation problem, and solves it by resource-bounded metaheuristic search in the symmetry group. It has low memory requirement and computational overhead, yet in preliminary experiments on BIBD design it breaks most symmetries.
منابع مشابه
Symmetry Breaking Predicates for SAT-based DFA Identification
It was shown before that the NP-hard problem of deterministic finite automata (DFA) identification can be effectively translated to Boolean satisfiability (SAT). Modern SAT-solvers can tackle hard DFA identification instances efficiently. We present a technique to reduce the problem search space by enforcing an enumeration of DFA states in depth-first search (DFS) or breadth-first search (BFS) ...
متن کاملSymmetry Breaking by Local Search
The presence of symmetry in constraint satisfaction problems can cause a great deal of wasted search effort, and several methods for breaking symmetries have been reported. We describe a new approach to partial symmetry breaking: using local search in the symmetry group to detect violated lex-leader constraints. The local search is interleaved with the backtrack search performed by the constrai...
متن کاملBreaking More Composition Symmetries Using Search Heuristics
The pruning power of partial symmetry breaking depends on the given subset of symmetries to break as well as the interactions among symmetry breaking constraints. In the context of Partial Symmetry Breaking During Search (ParSBDS), the search order determines the set of symmetry breaking constraints to add and thus also makes an impact on node and solution pruning. In this paper, we give the fi...
متن کاملSymmetry Breaking and Branching Constraints
Symmetry breaking is the process of eliminating redundant search by taking advantage of the symmetries in a problem. Symmetry breaking techniques can be combined with other search heuristics, such as branching constraints and variable orderings. The interaction between dynamic symmetry breaking and domain splitting is discussed, and preliminary results are presented showing the impact of variab...
متن کاملApproaches to Conditional Symmetry Breaking
Conditional symmetry arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Typically, the condition is a set of assignments of values to variables, i.e. a partial assignment reached during systematic search. Like unconditional symmetry, conditional symmetry can cause redundancy in a systematic search f...
متن کامل